DISSIMILAR EYES.

Dissimilar arc routing problems

Money collection presents particular problems in terms of effective vehicle routing. Planning the collection or distribution of money for ATMs or parking meters gives rise to two problems: while the total collecting time should be minimized, tours on successive days should be different to prevent robberies. The combination of these two problems is named as the Dissimilar Routing Problem. When t...

Aligning ‘dissimilar’ Images Directly

This paper introduces a hierarchical algorithm for the registration of corresponding images that do not necessarily have strong global similarity, such as multi-modal images, images with varying illumination (or specular reflection) and images with significant local motion. The method is based on the global maximization of an average local correlation measure, without the generation of similari...

Equivalence Checking of Dissimilar Circuits

We introduce the notion of a Common Specification of circuits that generalizes the current notion of structural similarity. A CS S of circuits N1 and N2 is a circuit of multi-valued blocks from which N1 and N2 can be produced by binary encoding. We show that the equivalence checking of N1,N2 in general resolution (which a non-deterministic proof system) is linear in the number of blocks in S. H...

Operating Dissimilar Alternators in Parallel

Cutting a Graph into Two Dissimilar

S G S e d Given a graph and a subset of the vertex set of , the discrepancy of is defined as th ifference between the actual and expected numbers of the edges in the subgraph induced on. We ¡ S n 2 ¢ £ £ £ £ £) n (n −1 4 s n e n <e < how that for every graph with vertices and edges, , there is an-element subset with the discrepancy of the order of magnitude of. For graphs with fewer than edges ...